Approximating largest convex hulls for imprecise points
نویسندگان
چکیده
منابع مشابه
Approximating Largest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point will lie. Such a region can be modelled as a circle, square, line segment, etc. We study the problem of maximising the area of the convex hull of such a set. We prove NP-hardness when the imprecise points are modelled as line segments, and give linear time approximation schemes for a var...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملDistributions of Points and Large Convex Hulls of k Points
We consider a variant of Heilbronn’s triangle problem by asking for fixed integers d, k ≥ 2 and any integer n ≥ k for a distribution of n points in the d-dimensional unit cube [0, 1] such that the minimum volume of the convex hull of k points among these n points is as large as possible. We show that there exists a configuration of n points in [0, 1], such that, simultaneously for j = 2, . . . ...
متن کاملConvex Hulls for Random Lines
Consider n i .i .d . random lines in the plane defined by their slope and distance from the origin . The slope is uniformly distributed on (0, 27r] and independent of the distance R from the origin . These lines define a set I of n(n 1)/2 intersection points . It was recently shown by Atallah and Ching and Lee that the cardinality of the convex hull of these intersection points is 0(n), and the...
متن کاملNew iteration process for approximating fixed points in Banach spaces
The object of this paper is to present a new iteration process. We will show that our process is faster than the known recent iterative schemes. We discuss stability results of our iteration and prove some results in the context of uniformly convex Banach space for Suzuki generalized nonexpansive mappings. We also present a numerical example for proving the rate of convergence of our res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2008
ISSN: 1570-8667
DOI: 10.1016/j.jda.2008.04.002